-
1 двоичное разложение
Mathematics: binary expansion, dyadic decomposition, dyadic expansionУниверсальный русско-английский словарь > двоичное разложение
-
2 двоичное представление
1) Computers: binary coded representation2) Engineering: binary notation, binary-coded representation3) Mathematics: (числа) binary notation, binary representation, dyadic expansion4) Mechanics: bit representation5) Patents: binary notation (чисел)6) Robots: binary representation (данных), bit representation (данных)Универсальный русско-английский словарь > двоичное представление
-
3 двоичное разложение
binary expansion мат., dyadic decompositionРусско-английский научно-технический словарь Масловского > двоичное разложение
См. также в других словарях:
Dyadic rational — Dyadic rationals in the interval from 0 to 1. In mathematics, a dyadic fraction or dyadic rational is a rational number whose denominator is a power of two, i.e., a number of the form a/2b where a is an integer and b is a natural number; for… … Wikipedia
Dyadic tensor — In multilinear algebra, a dyadic is a second rank tensor written in a special notation, formed by juxtaposing pairs of vectors, along with a notation for manipulating such expressions analogous to the rules for matrix algebra. Each component of a … Wikipedia
Dyadic transformation — xy plot where x = x0 ∈ [0, 1] is rational and y = xn for all n. The dyadic transformation (also known as the dyadic map, bit shift map, 2x mod 1 map, Bernoulli map, doubling map or sawtooth… … Wikipedia
Baker's map — In dynamical systems theory, the baker s map is a chaotic map from the unit square into itself. It is named after a kneading operation that bakers apply to dough: the dough is cut in half, and the two halves are stacked on one another, and… … Wikipedia
Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… … Wikipedia
Surreal number — In mathematics, the surreal number system is an arithmetic continuum containing the real numbers as well as infinite and infinitesimal numbers, respectively larger or smaller in absolute value than any positive real number. The surreals share… … Wikipedia
Cellulosic ethanol — also know by the name Ceetol, is a biofuel produced from wood, grasses, or the non edible parts of plants. [ One Hundred Tenth Congress of the United States of America. [http://frwebgate.access.gpo.gov/cgi bin/getdoc.cgi?dbname=110 cong… … Wikipedia
Minkowski's question mark function — Minkowski question mark function. ?(x) is on the left and ?(x) x is on the right. In … Wikipedia
Egyptian fraction — An Egyptian fraction is the sum of distinct unit fractions, such as frac{1}{2}+ frac{1}{3}+ frac{1}{16}. That is, each fraction in the expression has a numerator equal to 1 and a denominator that is a positive integer, and all the denominators… … Wikipedia
IBM 1401 — The IBM 1401, the first member of the IBM 1400 series, was a variable wordlength decimal computer that was announced by IBM on October 5, 1959. It was withdrawn on February 8, 1971.From the [http://www… … Wikipedia
Hardy space — In complex analysis, the Hardy spaces (or Hardy classes) Hp are certain spaces of holomorphic functions on the unit disk or upper half plane. They were introduced by Frigyes Riesz (Riesz 1923), who named them after G. H. Hardy, because of the… … Wikipedia